Minimal Attribute Space Bias for Attribute Reduction
نویسندگان
چکیده
Attribute reduction is an important inductive learning issue addressed by the Rough Sets society. Most existing works on this issue use the minimal attribute bias, i.e., searching for reducts with the minimal number of attributes. But this bias does not work well for datasets where different attributes have different sizes of domains. In this paper, we propose a more reasonable strategy called the minimal attribute space bias, i.e., searching for reducts with the minimal attribute domain sizes product. In most cases, this bias can help to obtain reduced decision tables with the best space coverage, thus helpful for obtaining small rule sets with good predicting performance. Empirical study on some datasets validates our analysis.
منابع مشابه
A Simple Fitness Function for Minimum Attribute Reduction
The goal of minimal attribute reduction is to find the minimal subset R of the condition attribute set C such that R has the same classification quality as C. This problem is well known to be NP-hard. When only one minimal attribute reduction is required, it was transformed into a nonlinearly constrained combinatorial optimization problem over a Boolean space and some heuristic search approache...
متن کاملApproaches to Attribute Reduction in Concept Lattices Based on Rough Set Theory
This paper mainly proposes notions and methods of attribute reduction in concept lattices based on rough set theory. Using dependence space of concept lattices, we first discuss the relationships between congruence relations and the corresponding concept lattices. We then define notions of attribute reduction in a formal context based on congruence relations which is to find the minimal attribu...
متن کاملA logic method for efficient reduction of the space complexity of the attribute reduction problem
The goal of attribute reduction is to find a minimal subset (MS) R of the condition attribute set C of a dataset such that R has the same classification power as C. It was proved that the number of MSs for a dataset with n attributes may be as large as (nn/2) and the generation of all of them is an NP-hard problem. The main reason for this is the intractable space complexity of the conversion o...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملAnalysis of alternative objective functions for attribute reduction in complete decision tables
Attribute reduction and reducts are important notions in rough set theory that can preserve discriminatory properties to the highest possible extent similar to the entire set of attributes. In this paper, the relationships among 13 types of alternative objective functions for attribute reduction are systematically analyzed in complete decision tables. For inconsistent and consistent decision ta...
متن کامل